Eulerian polar graphs
نویسندگان
چکیده
منابع مشابه
m-polar intuitionistic graphs and its properties
In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...
متن کاملEditing to Eulerian Graphs
We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let ea, ed and vd denote the operations edge addition, edge deletion and vertex deletion respectively. For any S ⊆ {ea, ed, vd}, we define Connected Degree Parity Editing(S) (CDPE(S)) to be the problem that takes as input a graph G, an integer k and...
متن کاملSubsemi - Eulerian Graphs
A graph is subeulerian if it is spanned by an eulerian supergraph. Boesch, Suffel and Tindell have characterized the class of subeulerian graphs and determined the minimum number of additional lines required to make a subeulerian graph eulerian. In this paper, we consider the related notion of a subsemi-eulerian graph, i.e. a graph which is spanned by a supergraph having an open trail containin...
متن کاملEmbeddings in Eulerian graceful graphs
Let G(V,E) be a graph of order n and size m. A graceful labeling of G is an injection f : V (G) → {0, 1, 2, ...,m} such that, when each edge uv is assigned the label f(uv) = |f(u)− f(v)|, the resultant edge labels are distinct. We focus on general results in graceful labeling, and provide an affirmative answer to the following open problem: Can every connected graph be embedded as an induced su...
متن کاملCircuit Decompositions of Eulerian Graphs
Let G be an eulerian graph. For each vertex v # V(G), let P(v) be a partition of the edges incident with v and set P= v # V(G) P(v), called a forbidden system of G. We say that P is admissible if |P & T | 2 |T | for every P # P and every edge cut T of G. H. Fleischner and A. Frank (1990, J. Combin. Theory Ser. B 50, 245 253) proved that if G is planar and P is any admissible forbidden system of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1976
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1976.101411